On the reliability of a number of S-P reducible graphsKATSADEMAS, S. L; KHALIL, Z. S.Microelectronics and reliability. 1987, Vol 27, Num 3, pp 493-505, issn 0026-2714Article

ROBUST LINEAR ALGORITHMS FOR CUTSETSROSEN BK.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 3; PP. 205-217; BIBL. 14 REF.Article

A NOTE ON UNIQUELY REDUCIBLE GRAPHS.MERRIELL D.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 21; NO 3; PP. 282-284; BIBL. 7 REF.Article

The Reduceron ReconfiguredNAYLOR, Matthew; RUNCIMAN, Colin.ACM SIGPLAN notices. 2010, Vol 45, Num 9, pp 75-86, issn 1523-2867, 12 p.Conference Paper

CHARACTERIZATIONS OF REDUCIBLE FLOW GRAPHS.HECHT MS; ULLMAN JD.1974; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1974; VOL. 21; NO 3; PP. 367-375; BIBL. 12 REF.Article

New methods for reducing size graphsFROSINI, P; PITTORE, M.International journal of computer mathematics. 1999, Vol 70, Num 3, pp 505-517, issn 0020-7160Article

A parallel algorithm for finding minimum cutsets in reducible graphsDEKEL, E; HU, J.Journal of parallel and distributed computing (Print). 1994, Vol 20, Num 1, pp 43-55, issn 0743-7315Article

A LINEAR TIME ALGORITHM FOR FINDING MINIMUM CUTSETS IN REDUCIBLE GRAPHSADI SHAMIR.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 645-655; BIBL. 7 REF.Article

CLASSIFICATION AUTOMATIQUE D'UN GRAND ENSEMBLE DE DONNEES PAR LA METHODE DES "GRAPHES REDUCTIBLES". APPLICATION A L'ANALYSE DE DONNEES GEOGRAPHIQUES.BRUYNOOGHE M.sdIN: ANAL. DONNEES ET INF. JOURN. INT. 1; VERSAILLES; 1977; LE CHESNAY; INST. RECH. INF. AUTOM.; DA. S.D.; VOL. 1; PP. 85-91; BIBL. 13 REF.Conference Paper

Safe reduction rules for weighted treewidthVAN DEN EIJKHOF, Frank; BODLAENDER, Hans L; KOSTER, Arie M. C. A et al.Algorithmica. 2007, Vol 47, Num 2, pp 139-158, issn 0178-4617, 20 p.Article

Optimal randomized algorithms for local sorting and set-maximaGODDARD, W; KENYON, C; KING, V et al.SIAM journal on computing (Print). 1993, Vol 22, Num 2, pp 272-283, issn 0097-5397Article

Primitives for resource management in a demand-driven reduction modelBHARAT JAYARAMAN; KELLER, R. M.International journal of parallel programming. 1986, Vol 15, Num 3, pp 215-244, issn 0885-7458Article

A characterization of weakly Church-Rosser abstract reduction systems that are not Church-RosserINTRIGILA, Benedetto; SALVO, Ivano; SORGI, Stefano et al.Information and computation (Print). 2001, Vol 171, Num 2, pp 137-155, issn 0890-5401Article

GENERATION OF NODE LISTS USING SEGMENT ANALYSISWADIA AB.1980; COMPUTER LANGUAGES; GBR; DA. 1980; VOL. 5; NO 2; PP. 115-129; BIBL. 10 REF.Article

An optimal path cover algorithm for cographsLIN, R; OLARIU, S; PRUESSE, G et al.Computers & mathematics with applications (1987). 1995, Vol 30, Num 8, pp 75-83, issn 0898-1221Article

On Accelerating the Computation of Weight Enumerators for Convolutional CodesAU, Edward K. S; WAI HO MOW.IEEE transactions on wireless communications. 2008, Vol 7, Num 6, pp 2009-2014, issn 1536-1276, 6 p.Article

Sampling ISP Backbone TopologiesVAQUERO, Luis M; SAE LOR, Suksant; AUDSIN, Dev et al.IEEE communications letters. 2012, Vol 16, Num 2, pp 272-274, issn 1089-7798, 3 p.Article

A general theory of sharing graphsGUERRINI, S.Theoretical computer science. 1999, Vol 227, Num 1-2, pp 99-151, issn 0304-3975Conference Paper

Isospectral graph reductions and improved estimates of matrices' spectraBUNIMOVICH, L. A; WEBB, B. Z.Linear algebra and its applications. 2012, Vol 437, Num 7, pp 1429-1457, issn 0024-3795, 29 p.Article

Live-Range Unsplitting for Faster Optimal CoalescingBLAZY, Sandrine; ROBILLARD, Benoit.ACM SIGPLAN notices. 2009, Vol 44, Num 7, pp 70-79, issn 1523-2867, 10 p.Conference Paper

Geometric constraint solverBOUMA, W; FUDOS, I; HOFFMANN, C et al.Computer-aided design. 1995, Vol 27, Num 6, pp 487-501, issn 0010-4485Article

The shortest path problem on large-scale real-road networksKLUNDER, G. A; POST, H. N.Networks (New York, NY). 2006, Vol 48, Num 4, pp 182-194, issn 0028-3045, 13 p.Article

Efficient calculation of sparse JacobiansTOLSMA, J. E; BARTON, P. I.SIAM journal on scientific computing (Print). 1999, Vol 20, Num 6, pp 2282-2296, issn 1064-8275Article

Reducible configurations for the cycle double cover conjectureHUCK, A.Discrete applied mathematics. 2000, Vol 99, Num 1-3, pp 71-90, issn 0166-218XConference Paper

Active learning of Gaussian processes with manifold-preserving graph reductionJIN ZHOU; SHILIANG SUN.Neural computing & applications (Print). 2014, Vol 25, Num 7-8, pp 1615-1625, issn 0941-0643, 11 p.Article